Tarski’s problem for solvable groups
نویسندگان
چکیده
منابع مشابه
refined solvable presentations for polycyclic groups
we describe a new type of presentation that, when consistent, describes a polycyclic group. this presentation is obtained by refining a series of normal subgroups with abelian sections. these presentations can be described effectively in computer-algebra-systems like {scshape gap} or {scshape magma}. we study these presentations and, in particular, we obtain consistency c...
متن کاملThe conjugacy problem in automaton groups is not solvable
Article history: Received 14 March 2012 Available online 17 May 2012 Communicated by Derek Holt
متن کاملSubgroups of Finitely Presented Groups with Solvable Conjugacy Problem
We prove that every countable group with solvable power problem embeds into a finitely presented 2-generated group with solvable power and conjugacy problems.
متن کاملFree-by-cyclic groups have solvable conjugacy problem
We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one of P. Brinkmann that one can determine whether two cyclic words in a free group are mapped to each other by some power of a given automorphism. The algorithm ...
متن کاملFreiman's theorem for solvable groups
Freiman’s theorem asserts, roughly speaking, if that a finite set in a torsion-free abelian group has small doubling, then it can be efficiently contained in (or controlled by) a generalised arithmetic progression. This was generalised by Green and Ruzsa to arbitrary abelian groups, where the controlling object is now a coset progression. We extend these results further to solvable groups of bo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1986
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1986-0826500-0